Potential-Function Proofs for First-Order Methods
نویسندگان
چکیده
This note discusses proofs for convergence of first-order methods based on simple potentialfunction arguments. We cover methods like gradient descent (for both smooth and non-smooth settings), mirror descent, and some accelerated variants.
منابع مشابه
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
Deduction modulo is a paradigm which consists in applying the inference rules of a deductive system—such as for instance natural deduction—modulo a rewrite system over terms and propositions. It has been shown that higher-order logic can be simulated into the first-order natural deduction modulo. However, a theorem stated by Gödel and proved by Parikh expresses that proofs in second-order arith...
متن کاملBLOW-UP AND NONGLOBAL SOLUTION FOR A FAMILY OF NONLINEAR HIGHER-ORDER EVOLUTION PROBLEM
In this paper we consider a kind of higher-order evolution equation as^{kt^{k} + ^{k&minus1}u/t^{k&minus1} +• • •+ut &minus{delta}u= f (u, {delta}u,x). For this equation, we investigate nonglobal solution, blow-up in finite time and instantaneous blow-up under some assumption on k, f and initial data. In this paper we employ the Test function method, the eneralized convexity method an...
متن کاملLearning from Multiple Proofs: First Experiments
Mathematical textbooks typically present only one proof for most of the theorems. However, there are infinitely many proofs for each theorem in first-order logic, and mathematicians are often aware of (and even invent new) important alternative proofs and use such knowledge for (lateral) thinking about new problems. In this paper we start exploring how the explicit knowledge of multiple (human ...
متن کاملContracting proofs to programs
This work describes a family of homomorphisms that contract natural deductions into typed ^-expressions, with the property that a convergence proof for an untyped program for function / is contracted to a typed program for /. The main novelties, compared to previous works on extracting algorithms from proofs, are the reading of deductions themselves as programs, and that instead of a constructi...
متن کاملFinite time stabilization of time-delay nonlinear systems with uncertainty and time-varying delay
In this paper, the problem of finite-time stability and finite-time stabilization for a specific class of dynamical systems with nonlinear functions in the presence time-varying delay and norm-bounded uncertainty terms is investigated. Nonlinear functions are considered to satisfy the Lipchitz conditions. At first, sufficient conditions to guarantee the finite-time stability for time-delay nonl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.04581 شماره
صفحات -
تاریخ انتشار 2017